Search results for "Dijkstra's algorithm"
showing 5 items of 5 documents
Scalable implementation of measuring distances in a Riemannian manifold based on the Fisher Information metric
2019
This paper focuses on the scalability of the Fisher Information manifold by applying techniques of distributed computing. The main objective is to investigate methodologies to improve two bottlenecks associated with the measurement of distances in a Riemannian manifold formed by the Fisher Information metric. The first bottleneck is the quadratic increase in the number of pairwise distances. The second is the computation of global distances, approximated through a fully connected network of the observed pairwise distances, where the challenge is the computation of the all sources shortest path (ASSP). The scalable implementation for the pairwise distances is performed in Spark. The scalable…
An Optimized Roadside Units (RSU) Placement for Delay-Sensitive Applications in Vehicular Networks
2015
International audience; Over the last few years, a lot of applications have been developed for Vehicular Ad Hoc NETworks (VANETs) to exchange information between vehicles. However, VANET is basically a Delay Tolerant Network (DTN) characterized by intermittent connectivity, long delays and message losses especially in low density regions [1]. Thus, VANET requires the use of an infrastructure such as Roadside Units (RSUs) that permits to enhance the network connectivity. Nevertheless, due to their deployment cost, RSUs need to be optimally deployed. Hence, the main objective of this work is to provide an optimized RSUs placement for delay-sensitive applications in vehicular networks that imp…
Optimal Paths on Urban Networks Using Travelling Times Prevision
2012
We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.
Direct Observation in 3d of Structural Crossover in Binary Hard Sphere Mixtures
2016
For binary fluid mixtures of spherical particles in which the two species are sufficiently different in size, the dominant wavelength of oscillations of the pair correlation functions is predicted to change from roughly the diameter of the large species to that of the small species along a sharp crossover line in the phase diagram [C. Grodon, M. Dijkstra, R. Evans & R. Roth, J.Chem.Phys. 121, 7869 (2004)]. Using particle-resolved colloid experiments in 3d we demonstrate that crossover exists and that its location in the phase diagram is in quantitative agreement with the results of both theory and our Monte-Carlo simulations. In contrast with previous work [J. Baumgartl, R. Dullens, M. …
Graph-based minimal path tracking in the skeleton of the retinal vascular network
2012
This paper presents a semi-automatic framework for minimal path tracking in the skeleton of the retinal vascular network. The method is based on the graph structure of the vessel network. The vascular network is represented based on the skeleton of the available segmented vessels and using an undirected graph. Significant points on the skeleton are considered nodes of the graph, while the edge of the graph is represented by the vessel segment linking two neighboring nodes. The graph is represented then in the form of a connectivity matrix, using a novel method for defining vertex connectivity. Dijkstra and Floyd-Warshall algorithms are applied for detection of minimal paths within the graph…